Search results for "Formal description"
showing 8 items of 8 documents
FORMAL CONCEPTION OF ROUGH SETS
1996
In the paper we present a formal description of rough sets within the framework of the generalized set theory, which is interpreted in the set approximation theory. The rough sets are interpreted as approximations, which are defined by means of the Pawlak's rough sets.
Formal Description of Rough Sets
1994
In the paper we present a formal description of rough sets within the limits of the generalized set theory, which is interpreted in the approximation of set theory. The rough sets are interpreted as an approximations, which are defined by means of the Pawlak’s rough sets.
Surface Reconstruction Based on a Descriptive Approach
2000
The design of complex surfaces is generally hard to achieve. A natural method consists in the subdivision of the global surface into basic surface elements. The different elements are independently designed and then assembled together to represent the final surface. This method requires a classification and a formal description of the basic elements. This chapter presents a general framework for surface description, based on a constructive tree approach. In this tree the leaves are surface primitives and the nodes are constructive operators.
Putting information back into biological communication.
2010
At the heart of many debates on communication is the concept of information. There is an intuitive sense in which communication implies the transfer of some kind of information, probably the reason why information is an essential ingredient in most definitions of communication. However, information has also been an endless source of misunderstandings, and recent accounts have proposed that information should be dropped from a formal definition of communication. In this article, we re-evaluate the merits and the internal logic of information-based vs. information-free approaches and conclude that information-free approaches are conceptually incomplete and operationally hindered. Instead, we …
Discrete-mathematical approach to formal description of measurement procedure
1996
The discrete-mathematical model of measurement procedure is developed for facilitating the description of measurements in both quantitative and qualitative scales. On the basis of this model the Measurement Problem is formulated. It is shown that the problem can be considered, in the general case, as one of the discrete optimization problems. The suggested approach brings closer the concepts of a computing algorithm and measurement procedure so that it permits the application of similar tools for the analysis and development of both of them.
Applications of Pattern-driven Methods in Corpus Linguistics
2018
The use of corpora has conventionally been envisioned as being either corpus-based or corpus-driven. While the formal definition of the latter term has been widely accepted since it was established by Tognini-Bonelli (2001), it is often applied to studies that do not, in fact, fullfil the fundamental requirement of a theory-neutral starting point. This volume proposes the term pattern-driven as a more precise alternative. The chapters illustrate a variety of methods that fall under this broad methodology, such as the extraction of lexical bundles, POS-grams and semantic frames, and demonstrate how these approaches can uncover new understandings of both synchronic and diachronic linguistic p…
Process Drama Based Information Management for Assessment and Classification in Learning
2013
In this chapter we present a formal description of information management for assessment and classification in learning. The description is supported by a structure related to drama process for learning. Our logic follows the idea of invoking uncertainties using underlying categories, and the language of processes in ‘drama process’ is taken to be BPMN (Business Process Modelling Notation).
A Problem Structuring Method
1991
Given a formal definition of problem and a formal definition of system, the equivalence between both concepts is studied. Considering a problem as a 3-tuple , where D is the set of possible data, R is the set of possible results, and P the set of conditions of the problem, classes of problems are constructed as combinations of types of data, types of results and types of conditions. For example, data can be either literal or numerical, either with uncertainty or not; conditions can be determined by rules, tables, equations, it may have uncertainty, etc. As a case of application it is outlined how some of the most common problems (knowledge representation, search, reasoning and planning, etc…